Partially Permutive Cellular Automata

نویسنده

Kari Eloranta

چکیده

One dimensional cellular automata are analyzed via their generalized permutivity. Invariant subalphabets provide a systematic way of identifying periodic and aperiodic tilings as well as stationary distributions invariant under the cellular automaton iteration. In the case of several invariant subalphabets a hierarchy of interaction phenomena arise. In particular the interaction of subalphabets can generate random walks as well as their degenerate forms. A comprehensive scheme emerges that uni es the analysis of topological defects in cellular automata. The probabilistic details of the random walks involved are treated in the companion paper [4].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Complexity of Permutive Cellular Automata

This paper studies cellular automata in two aspects: Ergodic and topological behavior. For ergodic aspect, the formulae of measure-theoretic entropy, topological entropy and topological pressure are given in closed forms and Parry measure is demonstrated to be an equilibrium measure for some potential function. For topological aspect, an example is examined to show that the exhibition of snap-b...

متن کامل

Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups

The decidability of the niteness problem for automaton groups is a well-studied open question on Mealy automata. We connect this question of algebraic nature to the periodicity problem of one-way cellular automata, a dynamical question known to be undecidable in the general case. We provide a rst undecidability result on the dynamics of one-way permutive cellular automata, arguing in favor of t...

متن کامل

Cellular Automata for Contour Dynamics Introduction

The dynamics of deterministic partially permutive cellular automata in two dimensions is considered. In particular we lay out the design principles and analyze the dynamics of generalized voter-type rules. They provide a two parameter model class of cellular automata which exhibit annealing, diiusive and critical domain behavior. We analyze the dynamics rigorously in certain cases and also show...

متن کامل

Remarks on permutive cellular automata

We prove that every n-dimensional permutive cellular automaton is conjugate to a one-sided shift with compact set of states. This is a generalization of a theorem of R. Gilman.

متن کامل